Object-Based Pose Graph for Dynamic Indoor Environments
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولDynamic graph-based search in unknown environments
A novel graph-based approach to search within unknown environments is presented. A virtual geometric structure is imposed upon the environment represented in memory by a graph. Algorithms use this representation to coordinate a team of robots (or entities). Local discovery of environment features causes dynamic expansion of the graph resulting in global exploration of the unknown environment. T...
متن کاملVision-based System for Head Pose Tracking in Indoor Immersive Environments
We describe an inexpensive, accurate, fast and scalable vision based indoor head pose tracking system. This system can be used for indoor tracking in VR and AR environments. Our approach uses video projectors to project a display grid pattern on the floor. The pattern consists of circular binary code color markers on a black and white checkerboard. A camera is attached to a user’s back, looking...
متن کاملPerformance characterisation of a feature-based Gaussian pose tracker for mobile robots in indoor environments
This paper introduces a redundant localisation system, combining a low-cost Gaussian pose tracker and a particle filter localiser which is more CPU intensive. Ideally, the Gaussian pose tracker can be used for most of the time and the particle filter localiser switched on only when the Gaussian pose tracker fails. The problem studied here is to determine when the Gaussian pose tracker has faile...
متن کاملDynamic Graph Based Slicing for Object-oriented Programs
This paper proposes a Dynamic Graph (DG) traversal slicing algorithm for computing dynamic slices of object-oriented programs in presence of inheritance. The computed dynamic slice can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering maintenance etc. This paper first proposes an intermediate program Dynamic Graph (DG) to repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2020
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2020.3007402